1. Identity statement | |
Reference Type | Journal Article |
Site | plutao.sid.inpe.br |
Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
Identifier | J8LNKAN8RW/3D543FT |
Repository | dpi.inpe.br/plutao/2012/11.28.18.47.40 (restricted access) |
Last Update | 2013:02.26.12.56.17 (UTC) administrator |
Metadata Repository | dpi.inpe.br/plutao/2012/11.28.18.47.41 |
Metadata Last Update | 2018:06.05.00.02.12 (UTC) administrator |
Secondary Key | INPE--PRE/ |
DOI | 10.1016/j.cie.2012.08.002 |
ISSN | 0360-8352 |
Label | lattes: 7195702087655314 2 MoreiradeCarvalhoNogu:2012:NeMoMi |
Citation Key | MoreiradeCarvalhoNogu:2012:NeMoMi |
Title | New models for the mirrored traveling tournament problem |
Project | FAPESP (2009/51831-9); CNPq (471837/2008-3), (300692/2009-9). |
Year | 2012 |
Access Date | 2024, May 04 |
Secondary Type | PRE PI |
Number of Files | 1 |
Size | 399 KiB |
|
2. Context | |
Author | 1 Moreira de Carvalho, Marco Antonio 2 Nogueira Lorena, Luiz Antonio |
Resume Identifier | 1 2 8JMKD3MGP5W/3C9JHMQ |
Group | 1 2 LAC-CTE-INPE-MCTI-GOV-BR |
Affiliation | 1 Ouro Preto Federal University 2 Instituto Nacional de Pesquisas Espaciais (INPE) |
Author e-Mail Address | 1 mamc@iceb.ufop.br 2 lorena@lac.inpe.br |
e-Mail Address | lorena@lac.inpe.br |
Journal | Computers and Industrial Engineering |
Volume | 63 |
Pages | 1089-1095 |
History (UTC) | 2012-11-28 23:06:34 :: lattes -> marciana :: 2012 2013-01-07 15:54:30 :: marciana -> administrator :: 2012 2013-01-20 15:55:28 :: administrator -> banon :: 2012 2013-02-04 17:53:04 :: banon -> marciana :: 2012 2013-02-27 17:49:58 :: marciana -> administrator :: 2012 2018-06-05 00:02:12 :: administrator -> marciana :: 2012 |
|
3. Content and structure | |
Is the master or a copy? | is the master |
Content Stage | completed |
Transferable | 1 |
Content Type | External Contribution |
Version Type | publisher |
Keywords | traveling tournament problem sports scheduling integer programming |
Abstract | The Mirrored Traveling Tournament Problem (mTTP) is a challenging combinatorial optimization problem which consists in generating a timetable for sports tournaments with two half series, what is equivalent to a double round-robin timetable problem. The distance traveled by the teams should be minimized in the final timetable, and a new objective is to minimize the longest distance traveled, named MinMaxTTP. It is proposed an integer programming formulation to the mTTP and two models with dynamic constraints to its solution. Both models are based on the detection of independent sets on conflict graphs, whose use has not been reported in the literature about the problem. Real data benchmarks from a baseball tournament are used in the experiments carried out. |
Area | COMP |
Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > New models for... |
doc Directory Content | access |
source Directory Content | there are no files |
agreement Directory Content | there are no files |
|
4. Conditions of access and use | |
Language | pt |
User Group | administrator banon lattes marciana |
Visibility | shown |
Archiving Policy | denypublisher denyfinaldraft36 |
Read Permission | deny from all and allow from 150.163 |
Update Permission | not transferred |
|
5. Allied materials | |
Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
Dissemination | PORTALCAPES |
Host Collection | dpi.inpe.br/plutao@80/2008/08.19.15.01 |
|
6. Notes | |
Empty Fields | alternatejournal archivist callnumber copyholder copyright creatorhistory descriptionlevel format isbn lineage mark mirrorrepository month nextedition notes number orcid parameterlist parentrepositories previousedition previouslowerunit progress readergroup rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject targetfile tertiarymark tertiarytype typeofwork url |
|
7. Description control | |
e-Mail (login) | marciana |
update | |
|